Scalable Normal Basis Arithmetic Unit for Elliptic Curve Cryptography
نویسندگان
چکیده
منابع مشابه
A Self-Timed Arithmetic Unit for Elliptic Curve Cryptography
This paper describes an efficient implementation of a crypto arithmetic unit, which computes the modularoperations addition, multiplication, and inversion in prime fields. These calculations are important for an application in elliptic curve cryptography (ECC). The hardware is designed in a self-timed and low-power approach. The paper discusses the pros and cons of this approach compared to a s...
متن کاملFast Arithmetic on ATmega128 for Elliptic Curve Cryptography
Authentication protocols are indispensable in wireless sensor networks. Commonly they are based on asymmetric cryptographic algorithms. In this paper we investigate all categories of finite fields suitable for elliptic curve cryptography on the ATmega128 microcontroller: Fp, F2d , and Fpd . It turns out that binary fields enable the most efficient implementations.
متن کاملEfficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography
We present a new sequential normal basis multiplier over GF (2). The gate complexity of our multiplier is significantly reduced from that of Agnew et al. and is comparable to that of Reyhani-Masoleh and Hasan, which is the lowest complexity normal basis multiplier of the same kinds. On the other hand, the critical path delay of our multiplier is same to that of Agnew et al. Therefore it is supp...
متن کاملEfficient Linear Array for Multiplication in GF (2) Using a Normal Basis for Elliptic Curve Cryptography
We present a new sequential normal basis multiplier over GF (2). The gate complexity of our multiplier is significantly reduced from that of Agnew et al. and is comparable to that of Reyhani-Masoleh and Hasan, which is the lowest complexity normal basis multiplier of the same kinds. On the other hand, the critical path delay of our multiplier is same to that of Agnew et al. Therefore it is supp...
متن کاملLow-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic
We introduce new modulus scaling techniques for transforming a class of primes into special forms which enables efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of scaled modulus. Our inversion algorithm exhibits superior performance to the Euclidean algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Polytechnica
سال: 2005
ISSN: 1805-2363,1210-2709
DOI: 10.14311/688